Heavy-traffic limits for queues with periodic arrival processes

نویسنده

  • Ward Whitt
چکیده

We establish conventional heavy-traffic limits for the number of customers in a Gt/GI/s queue with a periodic arrival process. We assume that the arrival counting process can be represented as the composition of a cumulative stochastic process that satisfies an FCLT and a deterministic cumulative rate function that is the integral of a periodic function. We establish three different heavy-traffic limits for three different scalings of the deterministic arrival rate function. The different scalings capture the three cases in which the predictable deterministic variability (i) dominates, (ii) is of the same order as, or (iii) is dominated by the stochastic variability in the arrival and service processes. © 2014 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.

This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt

متن کامل

Two-parameter Heavy-traffic Limits for Infinite-server Queues: Longer Version

In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic limits for two-parameter stochastic processes. We consider the random variables Qe(t, y) and Qr(t, y) representing the number of customers in the system at tim...

متن کامل

Two-parameter heavy-traffic limits for infinite-server queues

Abstract: In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic limits for two-parameter stochastic processes. We consider the random variables Qe(t, y) and Qr(t, y) representing the number of customers in the sys...

متن کامل

Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics

We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-time distributions, zero switch-over times, gated service at each queue, and with general renewal arrival processes at each of the queues. For this classical model, we propose a new method to derive closed-form expressions for the expected delay at each of the queues when the load tends to 1, under...

متن کامل

A note on polling models with renewal arrivals and nonzero switch-over times

We consider polling systems with general service times and switch-over times, gated service at all queues and with general renewal arrival processes. We derive closed-form expressions for the expected delay in heavy-traffic (HT). So far, rigorous proofs of HT limits have only been obtained for Poisson-type arrival processes, whereas for renewal arrivals HT limits are based on conjectures [5, 6,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Oper. Res. Lett.

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2014